A progressive black top hat transformation algorithm for estimating valley volumes on Mars
نویسندگان
چکیده
منابع مشابه
An Iterative Black Top Hat Transform Algorithm for the Volume Estimation of Lunar Impact Craters
Volume estimation is a fundamental problem in the morphometric study of impact craters. The Top Hat Transform function (TH), a gray-level image processing technique has already been applied to gray-level Digital Elevation Model (DEM) to extract peaks and pits in a nonuniform background. In this study, an updated Black Top Hat Transform function (BTH) was applied to quantify the volume of lunar ...
متن کاملBlack Hat Visualization
People lie, mislead, and bullshit in a myriad of ways. Visualizations, as a form of communication, are no exception to these tendencies. Yet, the language we use to describe how people can use visualizations to mislead can be relatively sparse. For instance, one can be “lying with vis” or using “deceptive visualizations.” In this paper, we use the language of computer security to expand the spa...
متن کاملAutomatic mapping of valley networks on Mars
Martian valley networks bear some resemblance to terrestrial drainage systems, but their precise origin remains an active research topic. A limited number of valley networks have been manually mapped from images, but the vast majority remains unmapped because standard drainage mapping algorithms are inapplicable to valleys that are poorly organized and lack spatial integration. In this paper we...
متن کاملA Semi-Automatic Algorithm for Estimating Cobb Angle
Background: Scoliosis is the most common type of spinal deformity. A universal and standard method for evaluating scoliosis is Cobb angle measurement, but several studies have shown that there is intra- and inter- observer variation in measuring cobb angle manually.Objective: Develop a computer- assisted system to decrease operator-dependent errors in Cobb angle measurement.Methods: The spinal ...
متن کاملA Top Hat for Moser's Four Mathemagical Rabbits
If the equation 1+2+ · · ·+(m−2)+(m−1) = m has a solution with k ≥ 2, then m > 10 6 . Leo Moser showed this in 1953 by remarkably elementary methods. His proof rests on four identities he derives separately. It is shown here that Moser’s result can be derived from a von Staudt-Clausen type theorem (an easy proof of which is also presented here). In this approach the four identities can be deriv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Geosciences
سال: 2015
ISSN: 0098-3004
DOI: 10.1016/j.cageo.2014.11.003